Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
نویسندگان
چکیده
منابع مشابه
Mutual exclusion between related phages.
The term mutual exclusion is used to designate an extreme form of interference which often occurs when two phage particles attack the same host cell. The cell liberates numerous particles of one of the parental types and not a single particle of the other parental type (Delbruck and Luria, 1942; Dulbriick, 1945). Mutual exclusion is the rule when the two infecting particles are very dissimilar....
متن کاملWhen does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملMutual exclusion revisited
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come firstserved algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris’s solution of the mutual exclusion with three weak semaphores. The presented algorithms compare favorably with equivalent published mu...
متن کاملMutual Exclusion by Interpolation
The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis that propagates determinacy requirements against the control flow, with a component for deriving so-called mutual exclusion conditions. The la...
متن کاملCheap Mutual Exclusion
A new method of enforcing mutual exclusion among concurrent processes on uniprocessors running UNIX is presented in this paper. When a process attempts to obtain a lock, no race condition will occur unless the process is preempted. The central idea is that a process can avoid a race condition if preemption is made visible to the process when it is rescheduled. Two possible implementations of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2010
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-010-0096-2